Efficient Admission Control for EDF Schedulers
نویسندگان
چکیده
In this paper we present algorithms for flow admission control at an EDF link scheduler when the flows are characterized by peak rate, average rate and burst size. We show that the algorithms have very low computational complexity and are easily applicable in practice. The complexity can be further decreased by introducing the notion of flex classes. We evaluate the penalty in efficiency that the classes incur to the EDF scheduler. We find that this efficiency degradation can be made arbitrarily small and is acceptable even for a small number of classes.
منابع مشابه
Achieving High Utilization in Guaranteed Services Networks Using Early-Deadline-First Scheduling
Among packet-scheduling disciplines for providing end-toend Quality-of-Service (QoS) guarantees to different applications, including real-time services, two classes of algorithms have received particular attention: those based on Generalized Processor Sharing (GPS) and those based on Earliest Deadline First (EDF). One reason for the popularity of GPS-based schemes is that their powerful propert...
متن کاملHigh Utilization Guarantee for Hierarchical Diff-EDF Schedulers
Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been pr...
متن کاملAnalysis of Hierarchical Diff-EDF Schedulability over Heterogeneous Real-Time Packet Networks
Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in conventional packet networks by the use of proper packet scheduling algorithms. As a computer revolution, many scheduling algorithms have been pr...
متن کاملCharacteristics of Agent-Based Hierarchical Diff-EDF Schedulability Over Heterogeneous Real-Time Packet Networks
Packet networks are currently enabling the integration of heterogeneous traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to best-effort traffic requiring no guarantees. QoS guarantees can be provided in packet networks by the use of proper packet scheduling algorithms. In this paper, we propose a new priority assignment scheduling algor...
متن کاملAn efficient and scalable implementation of global EDF in Linux
The increasing popularity of multi-core architectures is pushing researchers and developers to consider multi-cores for executing soft and hard real-time applications. Real-Time schedulers for multi processor systems can be roughly categorized into partitioned and global schedulers. The first ones are more adequate for hard real-time embedded systems, in which applications are statically loaded...
متن کامل